On Polygons Enclosing Point Sets II
نویسندگان
چکیده
Let R and B be disjoint point sets such that R ∪ B is in general position. We say that B encloses by R if there is a simple polygon P with vertex set B such that all the elements in R belong to the interior of P . In this paper we prove that if the vertices of the convex hull of R ∪ B belong to B, and |R| ≤ |Conv(B)| − 1 then B encloses R. The bound is tight. This improves on results of a previous paper in which it was proved that if |R| ≤ 56|Conv (B)| then B encloses R. To obtain our result we prove the next result which is interesting on its own right: Let P be a convex polygon with n vertices p1, . . . , pn and S a set of m points contained in the interior of P , m ≤ n− 1. Then there is a convex decomposition {P1, . . . , Pn} of P such that all points from S lie on the boundaries of P1, . . . , Pn, and each Pi contains a whole edge of P on its boundary.
منابع مشابه
Solving Geometric Problems with the Rotating Calipers *
Shamos [1] recently showed that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex polygon, or one set of calipers can be us...
متن کاملSmallest Enclosing Ball for a Point Set with Strictly Convex Level Sets
Let the center point be the point that minimizes the maximum distance from a point of a given point set to the center point. Finding this center point is referred to as the smallest enclosing ball problem. In case of points with Euclidean distance functions, the smallest enclosing ball is actually the center of a geometrical ball. We consider point sets with points that have distance functions ...
متن کاملErdös problem on point sets - a survey
This is a comprehensive survey on an interesting problem in combinatorial geometry first proposed by Erdös. The last most thorough survey in this area was by Morris and Soltan [20]. There has been a significant development in this area after this. In this survey, we present problems regarding point sets with (i) convex empty polygons and (ii) point subsets having a specified number of interior ...
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Mathematical Programming
We present a new algorithm for the two-dimensional translational containment problem: nd translations for k polygons which place them inside a polygonal container without overlapping. Both the polygons and the container can be nonconvex. The algorithm is based on mathematical programming principles. We generalize our containment approach to solve minimal enclosure problems. We give algorithms t...
متن کاملStatistical Techniques for Spatial Data Analysis
We distinguish three prevalent spatial data types, defined by the topology of the entity to which the recorded information refers. These are point, lines and area. Features having a specific location, but without extent in any direction are considered as points. A pair of coordinates represents a point. Village locations, industrial locations, cities etc. are the examples of the point data. Lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 25 شماره
صفحات -
تاریخ انتشار 2009